Acknowledged broadcasting in ad hoc radio networks

نویسندگان

  • Emanuele G. Fusco
  • Andrzej Pelc
چکیده

We consider ad hoc radio networks in which each node knows only its own identity but is unaware of the topology of the network, or of any bound on its size or diameter. Acknowledged broadcasting (AB) is a communication task consisting in transmitting a message from a distinguished source to all other nodes of the network and making this fact common knowledge among all nodes. To do this, the underlying directed graph must be strongly connected. Working in a model allowing all nodes to transmit spontaneously even before getting the source message, Chlebus et al. [6] proved that AB is impossible, if collision detection is not available, and gave an AB algorithm using collision detection that works in time O(nD) where n is the number of nodes and D is the eccentricity of the source. Uchida et al. [29] showed an AB algorithm without collision detection working in time O(n log n) for all strongly connected networks of size at least 2. In particular, it follows that the impossibility result from [6] is really caused by the singleton network for which AB amounts to realize that the source is alone. We improve those two results by presenting two generic AB algorithms using a broadcasting algorithm without acknowledgement, as a procedure. For a large class of broadcasting algorithms the resulting AB algorithm has the same time complexity. Using the currently best known broadcasting algorithms, we obtain an AB algorithm with collision detection working in time O(min{n log D,n logn log logn}), for arbitrary strongly connected networks, and an AB algorithm without collision detection working in time O(n log n log logn) for all strongly connected networks of size n ≥ 2. Moreover, we show that in the model in which only nodes that already got the source message can transmit, AB is infeasible in a strong sense: for any AB algorithm there exists an infinite family of networks for which this algorithm is incorrect. keywords: distributed computing, deterministic broadcasting, acknowledged broadcasting, radio network Computer Science Department, University of Rome ”La Sapienza”, 00198 Roma, Italy. E-mail: [email protected] This work was done during the visit of Emanuele G. Fusco at the Research Chair in Distributed Computing of the Université du Québec en Outaouais. Département d’informatique, Université du Québec en Outaouais, Gatineau, Québec J8X 3X7, Canada. Email: [email protected] Partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Faster Deterministic Broadcasting in Ad Hoc Radio Networks

We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time O(n log n). Our main...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Information dissemination in unknown radio networks with large labels

We consider the problems of deterministic broadcasting and gossiping in completely unknown ad-hoc radio networks. We assume that nothing is known to the nodes about the topology or even the size of the network, n, except that n > 1. Protocols for vanilla model, when n is known, may be run for increasingly larger estimates 2 on the size of the network, but one cannot determine when such a protoc...

متن کامل

Acknowledged Broadcasting and Gossiping in Ad Hoc Radio Networks

A radio network is a collection of transmitter-receiver devices (referred to as nodes). ARB (Acknowledged Radio Broadcasting) means transmitting a message from one special node called source to all the nodes and informing the source about its completion. In our model each node takes a synchronization per round and performs transmission or reception at one round. Each node does not have a collis...

متن کامل

Robust medical ad hoc sensor networks (MASN) with wavelet-based ECG data mining

Heart disease is the top elder killer in the world. To reduce the healthcare cost, it is a necessary tendency to deploy selforganized, wireless heart disease monitoring hardware/software systems. Telemedicine platform based on ad hoc interconnection of tiny ECG sensors, called medical ad hoc sensor networks (MASN), can provide a promising approach for performing low-cost, real-time, remote card...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 109  شماره 

صفحات  -

تاریخ انتشار 2008